Intersections among P ( 3 ) ( 2 , 4 ) - Designs 1
نویسنده
چکیده
A path-hypergraph P (3)(2, 4) is the uniform hypergraph of rank 3, having four vertices and two edges, with exactly two vertices in common. In this paper, the intersection problem among P (3)(2, 4)-designs of order v is studied and completely solved for every admissible v. Mathematics Subject Classification: 05B05
منابع مشابه
Partition of C 4-Designs into Minimum and Maximum Number of P 3-Designs
Let C be a C4-design of order n and index λ, on the vertex set V , |V | = n. If V1∪· · ·∪Vm = V is a partition of the vertex set, such that the intersections of the C ∈ C with Vi form a P3-design of order |Vi| and the same index λ, for each 1 ≤ i ≤ m, then 2 ≤ m ≤ log3(2n+1). The minimum bound is best possible for every λ. The maximum bound is best possible for λ = 2, and hence also for every e...
متن کاملOn Two Simple Criteria for Recognizing Complete Intersections in Codimension 2
Developing a previous idea of Faltings, we characterize the complete intersections of codimension 2 in P n , n ≥ 3, over an algebraically closed field of any characteristic, among l.c.i. X, as those that are subcanonical and scheme-theoretically defined by p ≤ n − 1 equations. Moreover, we give some other results assuming that the normal bundle of X extends to a numerically split bundle on P n ...
متن کامل0 On two simple criteria for recognizing complete intersections in codimension 2
Developing a previous idea of Faltings, we characterize the complete intersections of codimension 2 in P n , n ≥ 3, over an algebraically closed field of any characteristic, among l.c.i. X, as those that are subcanonical and scheme-theoretically defined by p ≤ n − 1 equations. Moreover we give some other results assuming that X is smooth and a numerical complete intersection, p ≤ n and the char...
متن کاملBlock Transitive Resolutions of t - designs andRoom
By a resolution of t-designs we mean a partition of the trivial design ? X k of all k-subsets of a v-set X into t ? (v 0 ; k;) designs, where v 0 v. A resolution of t-designs with v = v 0 is also called a large set of t-designs. A Room rectangle R, based on ? X k , is a rectangular array whose non-empty entries are k-sets. This array has the further property that taken together the rows form a ...
متن کاملMeasurement of Time Taken by the Formosan Termite, Coptotermes formosanus, to Pass Tunnel Intersections
Subterranean termites build complex tunnel networks below ground for foraging. During the foraging activity, termites may encounter a considerable number of tunnel intersections. When they encounter the intersections, they spend some time gathering information for making a decision regarding their moving direction by anntenation. The spent time is likely to be directly connected to the termites...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2016